Constructing Ordered Orthogonal Arrays via Sudoku
نویسنده
چکیده
For prime powers q we use “strongly orthogonal” linear sudoku solutions of order q to construct ordered orthogonal arrays of type OOA(4, s, 2, q), and for each q we present a range of values of s for which these constructions are valid. These results rely strongly on flags of subspaces in a four dimensional vector space over a finite field.
منابع مشابه
Construction and analysis of orthogonal (Graeco) Sudoku square designs
The present paper deals with the introduction of new experimental designs namely “Orthogonal Sudoku Square Designs”. A simple “sequential method” of constructing orthogonal Sudoku square designs (OSSD) of odd order is presented. The analysis of orthogonal Sudoku square designs is also discussed. The entire above is explained with the help of numerical examples.
متن کاملLinear Programming Bounds for Ordered Orthogonal Arrays and (T;M;S)-nets
A recent theorem of Schmid and Lawrence establishes an equivalence between (T; M; S)-nets and ordered orthogonal arrays. This leads naturally to a search both for constructions and for bounds on the size of an ordered orthogonal array. Subsequently, Martin and Stinson used the theory of association schemes to derive such a bound via linear programming. In practice, this involves large-scale com...
متن کاملAssociation Schemes for Ordered Orthogonal Arrays and (t,m,s)-nets
In an earlier paper 9], we studied a generalized Rao bound for ordered orthogonal arrays and (T; M; S)-nets. In this paper, we extend this to a coding-theoretic approach to ordered orthogonal arrays. Using a certain association scheme, we prove a MacWilliams-type theorem for linear ordered orthogonal arrays and linear ordered codes as well as a linear programming bound for the general case. We ...
متن کاملOrthogonal diagonal sudoku solutions: an approach via linearity
We prove that members of the complete family of mutually orthogonal sudoku solutions constructed by Petersen and Vis [College Math. J. 40, 174–180] are both parallel linear and diagonal, thereby resolving a conjecture of Keedwell [Australas. J. Combin. 47, 227–238].
متن کاملAn Algorithm for Constructing Orthogonal and Nearly-Orthogonal Arrays With Mixed Levels and Small Runs
Orthogonal arrays are used widely in manufacturing and high-technology industries for quality and productivity improvement experiments. For reasons of run size economy or flexibility, nearly orthogonal arrays are also used. The construction of orthogonal or nearly orthogonal arrays can be quite challenging. Most existing methods are complex and produce limited types of arrays. This article desc...
متن کامل